Interval Heaps
نویسندگان
چکیده
منابع مشابه
Binomial Heaps and Skew Binomial Heaps
We implement and prove correct binomial heaps and skew binomial heaps. Both are data-structures for priority queues. While binomial heaps have logarithmic findMin, deleteMin, insert, and meld operations, skew binomial heaps have constant time findMin, insert, and meld operations, and only the deleteMin-operation is logarithmic. This is achieved by using skew links to avoid cascading linking on ...
متن کاملTriangular Heaps
In this paper we introduce the triangular heap, a heap with the special property that for every father node its right child (if present) is smaller than its left child. We show how triangular heaps can be applied to the traditional problem of sorting an array in situ in ways quite similar to well-known methods using ordinary heaps. An average case analysis is presented for the construction and ...
متن کاملLayered Heaps
We introduce a framework for reducing the number of comparisons performed in the deletion and minimum deletion operations for priority queues. In particular, we give a priority queue with constant cost per insertion and minimum finding, and logarithmic cost with at most logn + O(log logn) 1 comparisons per deletion and minimum deletion, improving over the bound of 2 logn + O(1) comparisons for ...
متن کاملBoolean Heaps
We show that the idea of predicates on heap objects can be cast in the framework of predicate abstraction. This leads to an alternative view on the underlying concepts of three-valued shape analysis by Sagiv, Reps and Wilhelm. Our construction of the abstract post operator is analogous to the corresponding construction for classical predicate abstraction, except that predicates over objects on ...
متن کاملStrengthened Lazy Heaps: Surpassing the Lower Bounds for Binary Heaps
Let n denote the number of elements currently in a data structure. An in-place heap is stored in the first n locations of an array, uses O(1) extra space, and supports the operations: minimum , insert , and extract -min. We introduce an in-place heap, for which minimum and insert take O(1) worst-case time, and extract -min takes O(lg n) worst-case time and involves at most lg n+O(1) element com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1993
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/36.3.209